0.10/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.36	% Computer   : n004.cluster.edu
0.15/0.36	% Model      : x86_64 x86_64
0.15/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory     : 8042.1875MB
0.15/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 1200
0.15/0.36	% WCLimit    : 120
0.15/0.36	% DateTime   : Tue Jul 13 13:34:39 EDT 2021
0.15/0.36	% CPUTime    : 
0.15/0.36	% Number of cores: 8
0.15/0.36	% Python version: Python 3.6.8
0.15/0.36	# Version: 2.6rc1-ho
0.15/0.38	# No SInE strategy applied
0.15/0.38	# Trying AutoSched0 for 59 seconds
0.40/0.61	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.40/0.61	# and selection function SelectMaxLComplexAvoidPosPred.
0.40/0.61	#
0.40/0.61	# Preprocessing time       : 0.207 s
0.40/0.61	
0.40/0.61	# Proof found!
0.40/0.61	# SZS status Theorem
0.40/0.61	# SZS output start CNFRefutation
0.40/0.61	thf(def_n_is, axiom, (n_is)=(^[X741:$i, X742:$i]:(X741)=(X742)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.40/0.61	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.40/0.61	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.40/0.61	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.40/0.61	thf(def_n_eq, axiom, (n_eq)=(^[X1:$i, X218:$i]:(n_ts @ (num @ X1) @ (den @ X218))=(n_ts @ (num @ X218) @ (den @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_n_eq)).
0.40/0.61	thf(satz57a, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X490:$i]:in @ X490 @ nat) @ (^[X491:$i]:all_of @ (^[X4:$i]:in @ X4 @ nat) @ (^[X4:$i]:n_eq @ (n_fr @ (n_pl @ X1 @ X491) @ X4) @ (n_pf @ (n_fr @ X1 @ X4) @ (n_fr @ X491 @ X4))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz57a)).
0.40/0.61	thf(satz57, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X347:$i]:in @ X347 @ nat) @ (^[X348:$i]:all_of @ (^[X4:$i]:in @ X4 @ nat) @ (^[X4:$i]:n_eq @ (n_pf @ (n_fr @ X1 @ X4) @ (n_fr @ X348 @ X4)) @ (n_fr @ (n_pl @ X1 @ X348) @ X4)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz57)).
0.40/0.61	thf(c_0_7, axiom, (n_is)=(^[X741:$i, X742:$i]:(X741)=(X742)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.40/0.61	thf(c_0_8, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.40/0.61	thf(c_0_9, axiom, (n_eq)=(^[X1:$i, X218:$i]:(n_ts @ (num @ X1) @ (den @ X218))=(n_ts @ (num @ X218) @ (den @ X1))), inference(apply_def,[status(thm)],[def_n_eq, c_0_7])).
0.40/0.61	thf(c_0_10, negated_conjecture, ~(![X4470:$i]:(in @ X4470 @ nat=>![X4475:$i]:(in @ X4475 @ nat=>![X4476:$i]:(in @ X4476 @ nat=>(n_ts @ (num @ (n_fr @ (n_pl @ X4470 @ X4475) @ X4476)) @ (den @ (n_pf @ (n_fr @ X4470 @ X4476) @ (n_fr @ X4475 @ X4476))))=(n_ts @ (num @ (n_pf @ (n_fr @ X4470 @ X4476) @ (n_fr @ X4475 @ X4476))) @ (den @ (n_fr @ (n_pl @ X4470 @ X4475) @ X4476))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz57a]), c_0_8]), c_0_9])).
0.40/0.61	thf(c_0_11, plain, ![X2550:$i]:(in @ X2550 @ nat=>![X2555:$i]:(in @ X2555 @ nat=>![X2556:$i]:(in @ X2556 @ nat=>(n_ts @ (num @ (n_pf @ (n_fr @ X2550 @ X2556) @ (n_fr @ X2555 @ X2556))) @ (den @ (n_fr @ (n_pl @ X2550 @ X2555) @ X2556)))=(n_ts @ (num @ (n_fr @ (n_pl @ X2550 @ X2555) @ X2556)) @ (den @ (n_pf @ (n_fr @ X2550 @ X2556) @ (n_fr @ X2555 @ X2556))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz57, c_0_8]), c_0_9])).
0.40/0.61	thf(c_0_12, negated_conjecture, (in @ esk163_0 @ nat&(in @ esk164_0 @ nat&(in @ esk165_0 @ nat&(n_ts @ (num @ (n_fr @ (n_pl @ esk163_0 @ esk164_0) @ esk165_0)) @ (den @ (n_pf @ (n_fr @ esk163_0 @ esk165_0) @ (n_fr @ esk164_0 @ esk165_0))))!=(n_ts @ (num @ (n_pf @ (n_fr @ esk163_0 @ esk165_0) @ (n_fr @ esk164_0 @ esk165_0))) @ (den @ (n_fr @ (n_pl @ esk163_0 @ esk164_0) @ esk165_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
0.40/0.61	thf(c_0_13, plain, ![X5428:$i, X5429:$i, X5430:$i]:(~in @ X5428 @ nat|(~in @ X5429 @ nat|(~in @ X5430 @ nat|(n_ts @ (num @ (n_pf @ (n_fr @ X5428 @ X5430) @ (n_fr @ X5429 @ X5430))) @ (den @ (n_fr @ (n_pl @ X5428 @ X5429) @ X5430)))=(n_ts @ (num @ (n_fr @ (n_pl @ X5428 @ X5429) @ X5430)) @ (den @ (n_pf @ (n_fr @ X5428 @ X5430) @ (n_fr @ X5429 @ X5430))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])).
0.40/0.61	thf(c_0_14, negated_conjecture, (n_ts @ (num @ (n_fr @ (n_pl @ esk163_0 @ esk164_0) @ esk165_0)) @ (den @ (n_pf @ (n_fr @ esk163_0 @ esk165_0) @ (n_fr @ esk164_0 @ esk165_0))))!=(n_ts @ (num @ (n_pf @ (n_fr @ esk163_0 @ esk165_0) @ (n_fr @ esk164_0 @ esk165_0))) @ (den @ (n_fr @ (n_pl @ esk163_0 @ esk164_0) @ esk165_0))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.40/0.61	thf(c_0_15, plain, ![X1:$i, X4:$i, X5:$i]:((n_ts @ (num @ (n_pf @ (n_fr @ X1 @ X5) @ (n_fr @ X4 @ X5))) @ (den @ (n_fr @ (n_pl @ X1 @ X4) @ X5)))=(n_ts @ (num @ (n_fr @ (n_pl @ X1 @ X4) @ X5)) @ (den @ (n_pf @ (n_fr @ X1 @ X5) @ (n_fr @ X4 @ X5))))|~in @ X1 @ nat|~in @ X4 @ nat|~in @ X5 @ nat), inference(split_conjunct,[status(thm)],[c_0_13])).
0.40/0.61	thf(c_0_16, negated_conjecture, in @ esk165_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_12])).
0.40/0.61	thf(c_0_17, negated_conjecture, in @ esk164_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_12])).
0.40/0.61	thf(c_0_18, negated_conjecture, in @ esk163_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_12])).
0.40/0.61	thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16]), c_0_17]), c_0_18])]), ['proof']).
0.40/0.61	# SZS output end CNFRefutation
0.40/0.61	# Proof object total steps             : 20
0.40/0.61	# Proof object clause steps            : 6
0.40/0.61	# Proof object formula steps           : 14
0.40/0.61	# Proof object conjectures             : 8
0.40/0.61	# Proof object clause conjectures      : 5
0.40/0.61	# Proof object formula conjectures     : 3
0.40/0.61	# Proof object initial clauses used    : 5
0.40/0.61	# Proof object initial formulas used   : 7
0.40/0.61	# Proof object generating inferences   : 1
0.40/0.61	# Proof object simplifying inferences  : 4
0.40/0.61	# Training examples: 0 positive, 0 negative
0.40/0.61	# Parsed axioms                        : 577
0.40/0.61	# Removed by relevancy pruning/SinE    : 0
0.40/0.61	# Initial clauses                      : 969
0.40/0.61	# Removed in clause preprocessing      : 235
0.40/0.61	# Initial clauses in saturation        : 734
0.40/0.61	# Processed clauses                    : 213
0.40/0.61	# ...of these trivial                  : 2
0.40/0.61	# ...subsumed                          : 17
0.40/0.61	# ...remaining for further processing  : 194
0.40/0.61	# Other redundant clauses eliminated   : 47
0.40/0.61	# Clauses deleted for lack of memory   : 0
0.40/0.61	# Backward-subsumed                    : 0
0.40/0.61	# Backward-rewritten                   : 1
0.40/0.61	# Generated clauses                    : 593
0.40/0.61	# ...of the previous two non-trivial   : 522
0.40/0.61	# Contextual simplify-reflections      : 2
0.40/0.61	# Paramodulations                      : 477
0.40/0.61	# Factorizations                       : 0
0.40/0.61	# NegExts                              : 0
0.40/0.61	# Equation resolutions                 : 60
0.40/0.61	# Propositional unsat checks           : 0
0.40/0.61	#    Propositional check models        : 0
0.40/0.61	#    Propositional check unsatisfiable : 0
0.40/0.61	#    Propositional clauses             : 0
0.40/0.61	#    Propositional clauses after purity: 0
0.40/0.61	#    Propositional unsat core size     : 0
0.40/0.61	#    Propositional preprocessing time  : 0.000
0.40/0.61	#    Propositional encoding time       : 0.000
0.40/0.61	#    Propositional solver time         : 0.000
0.40/0.61	#    Success case prop preproc time    : 0.000
0.40/0.61	#    Success case prop encoding time   : 0.000
0.40/0.61	#    Success case prop solver time     : 0.000
0.40/0.61	# Current number of processed clauses  : 175
0.40/0.61	#    Positive orientable unit clauses  : 66
0.40/0.61	#    Positive unorientable unit clauses: 1
0.40/0.61	#    Negative unit clauses             : 3
0.40/0.61	#    Non-unit-clauses                  : 105
0.40/0.61	# Current number of unprocessed clauses: 1031
0.40/0.61	# ...number of literals in the above   : 4704
0.40/0.61	# Current number of archived formulas  : 0
0.40/0.61	# Current number of archived clauses   : 1
0.40/0.61	# Clause-clause subsumption calls (NU) : 5140
0.40/0.61	# Rec. Clause-clause subsumption calls : 2636
0.40/0.61	# Non-unit clause-clause subsumptions  : 19
0.40/0.61	# Unit Clause-clause subsumption calls : 785
0.40/0.61	# Rewrite failures with RHS unbound    : 0
0.40/0.61	# BW rewrite match attempts            : 9
0.40/0.61	# BW rewrite match successes           : 3
0.40/0.61	# Condensation attempts                : 0
0.40/0.61	# Condensation successes               : 0
0.40/0.61	# Termbank termtop insertions          : 191815
0.40/0.61	
0.40/0.61	# -------------------------------------------------
0.40/0.61	# User time                : 0.215 s
0.40/0.61	# System time              : 0.034 s
0.40/0.61	# Total time               : 0.249 s
0.40/0.61	# Maximum resident set size: 2700 pages
0.40/0.61	EOF